Permutation Routing on Mesh model Parallel Computers

This paper studies the problems of permutation routing on different mesh models of parallel computation and simulates algorithms for different mesh models using C. Simple algorithms for permutation routing mesh models with and without bus have been considered, analyzed and simulated. In mesh models with bus, models with fixed bus and reconfigurable buses are dealt. For problems in permutation routing on meshes with bus, a technique has been considered that can be used to develop deterministic algorithms that are better than the simpler algorithms. This paper also analyzes one deterministic algorithm derived using the technique for permutation routing on two dimensional networks and implements this algorithm using C. For permutation routing with reconfigurable bus the computational aspects of reconfigurable mesh model has been analyzed and simulating the problem in a simulator called RMSIM. A hardware for the reconfiguration switch is also suggested and implemented in VHDL. The design of the switch is based on restricted configuration model that involves ten different possible configurations. VHDL test pattern analysis for the switch, simulation results for the above-mentioned models are also provided.